Multi-threaded ASP solving with clasp
نویسندگان
چکیده
We present the new multi-threaded version of the state-of-the-art answer set solver clasp. We detail its component and communication architecture and illustrate how they support the principal functionalities of clasp. Also, we provide some insights into the data representation used for different constraint types handled by clasp. All this is accompanied by an extensive experimental analysis of the major features related to multi-threading in clasp. PUBLICATION NOTE: To appear in Theory and Practice of Logic Programming
منابع مشابه
Unsatisfiability-based optimization in clasp
Answer Set Programming (ASP) features effective optimization capacities based on branch-andbound algorithms. Unlike this, in the area of Satisfiability Testing (SAT) the finding of minimum unsatisfiable cores was put forward as an alternative approach to solving Maximum Satisfiability (MaxSAT) problems. We explore this alternative approach to optimization in the context of ASP. To this end, we ...
متن کاملclasp, claspfolio, aspeed: Three Solvers from the Answer Set Solving Collection Potassco
clasp1 combines the high-level modeling capacities of Answer Set Programming (ASP; [1]) with state-of-the-art techniques from the area of Boolean constraint solving. It is originally designed and optimized for conflict-driven ASP solving [2], [3], [4]. Most of its innovative algorithms and data structures, like e.g. ASP-oriented pre-processing [5] or native support of aggregates [6], are thus o...
متن کاملClingcon: The next generation
We present the third generation of the constraint answer set system clingcon, combining Answer Set Programming (ASP) with finite domain constraint processing (CP). While its predecessors rely on a black-box approach to hybrid solving by integrating the CP solver gecode, the new clingcon system pursues a lazy approach using dedicated constraint propagators to extend propagation in the underlying...
متن کاملAlgorithm Configuration for Portfolio-based Parallel SAT-Solving
Since 2004, the increases in processing power enabled by Moore’s law have been primarily achieved by means of multi-core processor architectures. To make effective use of modern hardware when solving hard computational problems, it is therefore necessary to employ parallel solution strategies. In this work, we demonstrate how effective parallel solvers for SAT, one of the most widely studied NP...
متن کاملConflict-driven answer set solving: From theory to practice
We introduce an approach to computing answer sets of logic programs, based on concepts successfully applied in Satisfiability (SAT) checking. The idea is to view inferences in Answer Set Programming (ASP) as unit propagation on nogoods. This provides us with a uniform constraint-based framework capturing diverse inferences encountered in ASP solving. Moreover, our approach allows us to apply ad...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- TPLP
دوره 12 شماره
صفحات -
تاریخ انتشار 2012